Spectral line extraction based on ant-colony algorithm
نویسندگان
چکیده
Abstract A spectral-line-extraction algorithm based on the ant-colony is proposed to address difficulty of extracting spectral lines in low signal-to-noise ratio conditions, and problem that results from optimal path falls into local optimization. The applies path-optimization strategy detect a line constructs corresponding mathematical model using grid method. new cost function replace length as optimization standard conventional algorithm. At same time, roulette rule used determine direction next step. This improves traditional heuristic function, increases attraction target route search, convergence rate. Sea-trial data show performs better with than
منابع مشابه
QoS Multicast Routing Algorithm Based on Crowding Ant Colony Algorithm
The basic ant colony algorithm is easy to fall into local optimum and its convergent speed is slow for solving multiple QoS multicast routing problems. Therefore, a crowding ant colony algorithm is proposed in this paper to solve the problems. Crowded degree in artificial fish swarm algorithm is used to adjust nodes transition strategy dynamically according to the congestion of nodes. Stagnatio...
متن کاملImage Segmentation Algorithm Based on Improved Ant Colony Algorithm
In the process of image segmentation, the basic ant colony algorithm has some disadvantages, such as long searching time, large amounts of calculation, and rough image segmentation results. This paper proposes an improved ant colony algorithm. Applying different transfer rules and pheromone update strategies to different regions of an image, including background, target, edge and noise, we deve...
متن کاملMobile Agent Routing Algorithm Based on Improved Ant Colony Algorithm
At the present stage wireless sensor network exists some deficiencies such as finite energy, limited communication capability, multi-hop routing and dynamic topology. In addition too many nodes which are distributed intensively influence also performance of wireless sensor network. Besides distributed optimization problem always impact to efficiency of the network. For data processing and routi...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملDistributed Service Discovery Algorithm Based on Ant Colony Algorithm
UDDI is a universal description, discovery and integration protocol. As a public registry of Web service, it is designed to store information about each company and its service. Traditional centralized service discovery structure of UDDI service registration center does not apply to largescale service discovery. When all the services register to a center, the service bottleneck, failure of sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2021
ISSN: ['1687-6180', '1687-6172']
DOI: https://doi.org/10.1186/s13634-021-00823-6